Successive Minima and Best Simultaneous Diophantine Approximations
نویسندگان
چکیده
We study the problem of best approximations of a vector α ∈ R n by rational vectors of a lattice Λ ⊂ R whose common denominator is bounded. To this end we introduce successive minima for a periodic lattice structure and extend some classical results from geometry of numbers to this structure. This leads to bounds for the best approximation problem which generalize and improve former results.
منابع مشابه
The best Diophantine approximations: the
This brief survey deals with multi-dimensional Diophantine approximations in sense of linear form and with simultaneous Diophantine approximations. We discuss the phenomenon of degenerate dimension of linear sub-spaces generated by the best Diophantine approximations. Originally most of these results have been established by the author in [14, 15, 16, 17, 18]. Here we collect all of them togeth...
متن کاملBest Simultaneous Diophantine Approximations under a Constraint on the Denominator
We investigate the problem of best simultaneous Diophantine approximation under a constraint on the denominator, as proposed by Jurkat. New lower estimates for optimal approximation constants are given in terms of critical determinants of suitable star bodies. Tools are results on simultaneous Diophantine approximation of rationals by rationals with smaller denominator. Finally, the approximati...
متن کاملTest Sets of the Knapsack Problem and Simultaneous Diophantine Approximations
This paper deals with the study of test sets of the knapsack problem and simultaneous diophantine approximation. The Graver test set of the knapsack problem can be derived from minimal integral solutions of linear diophantine equations. We present best possible inequalities that must be satisfied by all minimal integral solutions of a linear diophantine equation and prove that for the correspon...
متن کاملKnapsack Public Key Cryptosystems And
This paper presents and analyzes cryptanalytic attacks on knapsack public key cryptosystems that are based on ideas from Diophantine approximation. Shamir’s attack on the basic Merkle-Hellman knapsack cryptosystem is shown to depend on the existence of ‘‘unusually good’’ simultaneous Diophantine approximations to a vector constructed from the public key. This aspect of Shamir’s attack carries o...
متن کاملTest sets of the knapsack problem and simultaneous diophantine approximation
Absact This paper deals with the study of test sets of the knapsack problem and simultaneous diophantine approximation. The Graver test set of the knapsack problem can be derived from minimal integral solutions of linear diophantine equations. We present best possible inequalities that must be satisfied by all minimal integral solutions of a linear diophantine equation and prove that for the co...
متن کامل